Model Checking Semi-Continuous Time Models Using BDDs

نویسندگان

  • Sérgio Vale Aguiar Campos
  • Marcio Teixeira
  • Marius Minea
  • Andreas Kuehlmann
  • Edmund M. Clarke
چکیده

The veri cation of timed systems is extremely important but also extremely di cult Several methods have been proposed to assist in this task including extensions to symbolic model checking One possible use of model checking to analyze timed systems is by modeling passage of time as the number of taken transitions and ap plying quantitative algorithms to determine the timing parameters of the system The advantage of this method is its simplicity and e ciency In this paper we extend this technique in two ways First we present new quantitative algorithms that are more e cient than their predecessors The new algorithms determine the number of occurrences of events in all paths between a set of starting states and a set of nal states We then use these algorithms to introduce a new model of time in which the passage of time is dissociated from the occurrence of events With this new model it is possible to verify systems that were previously thought to require dense time models We use the new method to verify two such examples previously analyzed by the HyTech tool a steam boiler example and a fuel injection controller

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PRISM: Probabilistic Symbolic Model Checker

In this paper we describe PRISM, a tool being developed at the University of Birmingham for the analysis of probabilistic systems. PRISM supports three probabilistic models: discrete-time Markov chains, continuous-time Markov chains and Markov decision processes. Analysis is performed through model checking such systems against specifications written in the probabilistic temporal logics PCTL an...

متن کامل

Bounded Model Checking of GSMP Models of Stochastic Real-Time Systems

Model checking is a popular algorithmic verification technique for checking temporal requirements of mathematical models of systems. In this paper, we consider the problem of verifying bounded reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMP). While GSMPs is a rich model for stochastic systems widely used in performance evaluation, exist...

متن کامل

Combining Partial Order Reduction with Bounded Model Checking

Model checking is an efficient technique for verifying properties on reactive systems. Partial-order reduction (POR) and symbolic model checking are two common approaches to deal with the state space explosion problem in model checking. Traditionally, symbolic model checking uses BDDs which can suffer from space blowup. More recently bounded model checking (BMC) using SAT-based procedures has b...

متن کامل

BDD-Based Software Model Checking with CPAchecker

In symbolic software model checking, most approaches use predicates as symbolic representation of the state space, and SMT solvers for computations on the state space; BDDs are sometimes used as auxiliary data structure. The representation of software state spaces by BDDs was not yet thoroughly investigated, although BDDs are successful in hardware verification. The reason for this is that BDDs...

متن کامل

Efficient Verification of Timed Automata using BDDs

This paper investigates the efficient reachability analysis of timed automata. It describes a discretization of time which preserves the reachability properties. The discretization allows to represent sets of configurations of timed automata as binary decision diagrams (BDDs). Further techniques, like computing good variable orderings, are applied to use the full potential of BDDs as compact an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 1999